-
1 graph-based algorithm
алгоритм, що ґрунтується на теорії графів, графооріентований алгоритмEnglish-Ukrainian dictionary of microelectronics > graph-based algorithm
-
2 algorithm
- aim algorithm
- automatic placement and routing algorithm
- backward error recovery algorithm
- best path algorithm
- bit-map oriented spatial processing algorithm
- block-oriented algorithm
- branch and bound algorithm
- channel algorithm
- D algorithm
- deductive algorithm
- discard algorithm
- exact embedding algorithm
- expansion algorithm
- fast-Fourier-transform algorithm
- graph-based algorithm
- Gummel’s algorithm
- hidden-line algorithm
- image processing algorithm
- iterative algorithm
- Lee algorithm
- min-cut algorithm
- modified Lee algorithm
- N-step algorithm
- one-direction algorithm
- pessimistic simulation algorithm
- random-search algorithm
- repair-most algorithm
- Roth’s D algorithm
- routing algorithm
- Schonhage algorithm
- selective-trace algorithm
- sequential algorithm
- stable sorting algorithm
- star algorithm
- table-driven algorithm
- 9-value D- algorithm
- wiring algorithmEnglish-Ukrainian dictionary of microelectronics > algorithm
См. также в других словарях:
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Graph drawing — This article is about the general subject of graph drawing. For the annual research symposium, see International Symposium on Graph Drawing. Graphic representation of a minute fraction of the WWW, demonstrating hyperlinks. Graph drawing is an… … Wikipedia
Force-based algorithms — Force based or force directed algorithms are a class of algorithms for drawing graphs in an aesthetically pleasing way. Their purpose is to position the nodes of a graph in two dimensional or three dimensional space so that all the edges are of… … Wikipedia
Minimum spanning tree-based segmentation — Contents 1 Image segmentation introduction 2 Motivation for graph based methods 3 From images to graphs 4 Minimum Spanning Tree segmentation algorithms … Wikipedia
Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and … Wikipedia
Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… … Wikipedia
Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance … Wikipedia
List of graph theory topics — This is a list of graph theory topics, by Wikipedia page. See glossary of graph theory for basic terminology Contents 1 Examples and types of graphs 2 Graph coloring 3 Paths and cycles 4 … Wikipedia
Dijkstra–Scholten algorithm — The Dijkstra–Scholten algorithm (named after Edsger W. Dijkstra and C. S. Scholten) is an algorithm for detecting termination in a distributed system. The algorithm was proposed by Dijkstra and Scholten in 1980. First, let us consider the case of … Wikipedia
